An Elementary Proof of the Strong Converse Theorem for the Multiple–Access Channel
نویسنده
چکیده
In [1] we determined the capacity region of the multiple–access channel (MAC) by proving a coding theorem and its weak converse. Recently Dueck [2] proved a strong converse theorem in the sense of Wolfowitz [3]. His proof uses the Ahlswede–Gács–Körner [4] method of “blowing up decoding sets” in conjunction with a new “wringing technique”. This technique makes it now possible to prove strong converses, if the average error probability criterion is genuinely used (as in the case in the results for the MAC mentioned above, c.f. [5]).
منابع مشابه
Coding Theorem and Strong Converse for Quantum Channels
In this correspondence, we present a new proof of Holevo’s coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz’s combinatorial approach using types of sequences. As a byproduct of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new pr...
متن کاملArbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities
We consider compound as well as arbitrarily varying classical-quantum channel models. For classical-quantum compound channels, we give an elementary proof of the direct part of the coding theorem. A weak converse under average error criterion to this statement is also established. We use this result together with the robustification and elimination technique developed by Ahlswede in order to gi...
متن کاملBounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کاملStrong converse exponents for the feedback-assisted classical capacity of entanglement-breaking channels
Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an enta...
متن کاملA Strong Converse Theorem for Quantum Multiple Access Channels
With the wringing technique developed by the first author for classical multiple access channels we show that the strong converse theorem holds also for quantum multiple access channels, if classical messages are transmitted.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1982